155B - Combination - CodeForces Solution


greedy sortings *1100

Please click on ads to support us..

Python Code:

n = int(input())
l = []
for i in range(n):
	l.append(list(map(int, input().split())))
l.sort(key=lambda x: (-x[1], -x[0]))
c = 1
ind = 0
ans = 0
while c > 0 and ind < n:
	ans += l[ind][0]
	c += l[ind][1]
	ind += 1
	c -= 1
print(ans)


Comments

Submit
0 Comments
More Questions

1472C - Long Jumps
1293D - Aroma's Search
918A - Eleven
1237A - Balanced Rating Changes
1616A - Integer Diversity
1627B - Not Sitting
1663C - Pōja Verdon
1497A - Meximization
1633B - Minority
688B - Lovely Palindromes
66B - Petya and Countryside
1557B - Moamen and k-subarrays
540A - Combination Lock
1553C - Penalty
1474E - What Is It
1335B - Construct the String
1004B - Sonya and Exhibition
1397A - Juggling Letters
985C - Liebig's Barrels
115A - Party
746B - Decoding
1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping
237A - Free Cash